A Sign-Reversing Involution on Bimahonian Generating Functions
نویسندگان
چکیده
We explicitly evaluate the generating functions for joint distributions of pairs of the permutation statistics inv, maj and ch over the symmetric group when both variables are set to −1. We give a combinatorial proof by means of a sign-reversing involution that specializing the variables to −1 in these bimahonian generating functions gives the number of two-colored permutations up to sign.
منابع مشابه
Two Variable Pfaffian Identities and Symmetric Functions
We give sign-reversing involution proofs of a pair of two variable Pfaffian identities. Applications to symmetric function theory are given, including identities relating Pfaffians and Schur functions. As a corollary we are able to compute the plethysm p2 ° skn •
متن کاملA sign-reversing involution for an extension of Torelli's Pfaffian identity
We evaluate the hyperpfaffian of a skew-symmetric k-ary function polynomial f of degree k/2 · (n−1). The result is a product of the Vandermonde product and a certain expression involving the coefficients of the polynomial f . The proof utilizes a sign reversing involution on a set of weighted, oriented partitions. When restricting to the classical case when k = 2 and the polynomial is (xj − xi)...
متن کاملA Sign-reversing Involution for Rooted Special Rim-hook Tableaux
Eg̃eciog̃lu and Remmel [2] gave an interpretation for the entries of the inverse Kostka matrix K in terms of special rim-hook tableaux. They were able to use this interpretation to give a combinatorial proof that KK = I but were unable to do the same for the equation KK = I. We define a sign-reversing involution on rooted special rim-hook tableaux which can be used to prove that the last column o...
متن کاملCombinatorial Proofs of Bivariate Generating Functions on Coxeter Groups
McMahon’s result that states the length and major index statistics are equidistributed on the symmetric group Sn has generalizations to other Coxeter groups. Adin, Brenti and Roichman have defined analogues of those statistics for the hyperoctahedral group, Bn and proved equidistribution theorems. Using combinatorial interpretations of Regev and Roichman’s statistics length and delent, we consi...
متن کاملDecomposing Labeled Interval Orders as Pairs of Permutations
We introduce ballot matrices, a signed combinatorial structure whose definition naturally follows from the generating function for labeled interval orders. A sign reversing involution on ballot matrices is defined. We show that matrices fixed under this involution are in bijection with labeled interval orders and that they decompose to a pair consisting of a permutation and an inversion table. ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Ars Comb.
دوره 100 شماره
صفحات -
تاریخ انتشار 2011